The gradient-based cache partitioning algorithm
نویسندگان
چکیده
منابع مشابه
Utility-Based Cache Partitioning
This paper investigates the problem of partitioning a shared cache between multiple concurrently executing applications. The commonly used LRU policy implicitly partitions a shared cache on a demand basis, giving more cache resources to the application that has a high demand and fewer cache resources to the application that has a low demand. However, a higher demand for cache resources does not...
متن کاملDynamic Cache Partitioning Based on the MLP of Cache Misses
Dynamic partitioning of shared caches has been proposed to improve performance of traditional eviction policies in modern multithreaded architectures. All existing Dynamic Cache Partitioning (DCP) algorithms work on the number of misses caused by each thread and treat all misses equally. However, it has been shown that cache misses cause different impact in performance depending on their distri...
متن کاملEfficient Way-based Cache Partitioning for Low-Associativity Cache
Cache Partitioning is well-known technique to reduce destructive interference among co-running applications in a shared last-level cache (SLLC). Way-based cache partitioning is a popular partitioning scheme due to its simplicity, but it can dramatically reduce associativity of each partition. Also, most SLLC have limited associativity because the higher associativity causes the higher cache acc...
متن کاملSpi Loop Partitioning versus Tiling for Cache-based Multiprocessors Loop Partitioning versus Tiling for Cache-based Multiprocessors Loop Partitioning versus Tiling for Cache-based Multiprocessors
In this paper, an eecient algorithm to implement loop partitioning is introduced and evaluated. We improve recent results of Agarwal, Kranz and Natarajan 1] in several directions. We give a more accurate estimation of the cumulative footprint, and we derive a much more powerful algorithm to determine the optimal tile shape. We illustrate the superiority of our algorithm on the same examples as ...
متن کاملLoop Partitioning for Cache-based Multiprocessors
In this paper, an eecient algorithm to implement loop partitioning is introduced and evaluated. We improve recent results of Agarwal, Kranz and Natarajan 1] in several directions. We derive a new formulation of the cumulative footprint, which enables us to deal with arbitrary parallelepiped-shaped tiles, as opposed to rectangular tiles in 1]. We design an eecient heuris-tic to determine the opt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Architecture and Code Optimization
سال: 2012
ISSN: 1544-3566,1544-3973
DOI: 10.1145/2086696.2086723